Two Results on Domino and Ribbon Tableaux
نویسنده
چکیده
Inspired by the spin-inversion statistic of Schilling, Shimozono and White [8] and Haglund et al. [2] we relate the symmetry of ribbon functions to a result of van Leeuwen, and also describe the multiplication of a domino function by a Schur function.
منابع مشابه
A Color-to-Spin Domino Schensted Algorithm
We describe the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen. We place this algorithm in the context of Haiman’s mixed and leftright insertion algorithms and extend it to colored words. It follows easily from this description that total color of a colored word maps to the sum of the spins of a pair of 2-ribbon tableaux. Various other properties of this algorithm are ...
متن کاملPieri and Cauchy Formulae for Ribbon Tableaux
In [LLT] Lascoux, Leclerc and Thibon introduced symmetric functions Gλ which are spin and weight generating functions for ribbon tableaux. This article is aimed at studying these functions in analogy with Schur functions. In particular we will describe: • a Pieri and dual-Pieri formula for ribbon functions, • a ribbon Murnaghan-Nakayama formula, • ribbon Cauchy and dual Cauchy identities, • and...
متن کاملRibbon Tableaux and the Heisenberg Algebra
In [LLT] Lascoux, Leclerc and Thibon introduced symmetric functions Gλ which are spin and weight generating functions for ribbon tableaux. This article is aimed at studying these functions in analogy with Schur functions. In particular we will describe: • a Pieri and dual-Pieri formula for ribbon functions, • a ribbon Murnagham-Nakayama formula, • ribbon Cauchy and dual Cauchy identities, • and...
متن کاملPlactic relations for r-domino tableaux
The recent work of Bonnafé et al. [2] shows through two conjectures that r-domino tableaux have an important role in Kazhdan-Lusztig theory of type B with unequal parameters. In this paper we provide plactic relations on signed permutations which determine whether given two signed permutations have the same insertion r-domino tableaux in Grafinkle’s algorithm [3]. Moreover, we show that a parti...
متن کاملq - al g / 97 09 01 0 v 2 15 S ep 1 99 7 DOMINO TABLEAUX , SCH
We deene an action of the symmetric group S n 2 ] on the set of domino tableaux, and prove that the number of domino tableaux of weight 0 does not depend on the permutation of the weight 0. A bijective proof of the well-known result due to J. Stembridge that the number of self{evacuating tableaux of a given shape and weight = (1 ; : : : ; n+1 2 ] ; n 2 ] ; : : : ; 1), is equal to that of domino...
متن کامل